A General Framework to Solve Agreement Problems
نویسندگان
چکیده
Agreement problems are among the most important problems designers of distributed systems have to cope with. A way to solve them is to first provide a solution to the Consensus problem and then to reduce each agreement problem to Consensus. This “run-time customizing” approach is particularly relevant when upper layer applications have to solve several distinct agreement problems. In this paper we investigate a “compile-time customizing” approach to automatically generate ad hoc agreement protocols. A general agreement framework, characterized by six “versatility” parameters, is defined. Appropriate instantiations of these parameters provide particular agreement protocols. This approach is particularly suited to generate efficient agreement protocols.
منابع مشابه
The application of TRIZ to solve the GSC problems in Sobhanoncology pharmaceutical firm.
The purpose of this paper is to apply TRIZ for solving the GSC problems in Sobhanoncology pharmaceutical firm. A review of the past papers of TRIZ based methods to GSC problem resolution is presented. The TRIZ contradiction matrix tool which was applied to the specific problem brings many benefits e.g.: being rapid acceleration in solving the problem. Moreover provides repeatability, reliabilit...
متن کاملHow to Escape Irrelevance: Performance Philosophy, Public Philosophy and Borderless Philosophy
Carlo Cellucci has rightly pointed out that contemporary professional academic philosophy has a serious problem of irrelevance. Performance philosophy and public philosophy are two recent attempts to solve that problem and radically transform professional academic philosophy into what I call real philosophy. Nevertheless, performance philosophy and public philosophy have some prima facie probl...
متن کاملA Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...
متن کاملA Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملFunctional Programming and Discrete Simulation
Abstrakt In this note we critically examine the current state of teaching of Discrete Simulation at our university. We consider the case study of one of the projects that students are expected to solve in the course. Three approaches are compared nonmodular resulting from the current approach, using Haskell, and using Reactive framework from C#. We conclude that functional approach can address ...
متن کامل